A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

Authors

  • Farhad Rahmati Associate Professor, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
  • Frazad Didehvar Assistant Professor, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
  • Majid Yousefikhoshbakht Assistant Professor, Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran
Abstract:

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after serving the last customer. Because of its numerous applications in industrial and service problems, a new model of the HFFOVRP based on mixed integer programming is proposed in this paper. Furthermore, due to its NP-hard nature, an ant colony system (ACS) algorithm was proposed. Since there were no existing benchmarks, this study generated some test problems. From the comparison with the results of exact algorithm, the proposed algorithm showed that it can provide better solutions within a comparatively shorter period of time.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

a mixed integer programming formulation for the heterogeneous fixed fleet open vehicle routing problem

the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...

full text

An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

full text

A Model for Heterogeneous Fixed Fleet Vehicle Routing Problem

Transportation is one of the important infrastructures constituting the base and requisite for different levels of people’s access and movement to various locations. Transportation systems are one of the indices of the development of a region. Optimizing these systems contributes to improving performance and reducing costs of offering services to users. Hence, methods should be adopted with whi...

full text

Mixed Integer Programming Model for Split Delivery Vehicle Routing Problem with Fleet and Driver Scheduling

Vehicle Routing Problem (VRP) is a key element of many transportation systems which involve routing of fleet of vehicles from a depot to a set of customers node. It is required that these vehicles return to the depot after serving customers’ demand. This paper investigates a relaxed version of VRP, in which the number of visits to the customer is not restricted to be at most one. The relaxed ve...

full text

A mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem

In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...

full text

A New Mathematical Model for the Green Vehicle Routing Problem by Considering a Bi-Fuel Mixed Vehicle Fleet

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 8  issue 18

pages  37- 46

publication date 2015-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023